On first-order algorithms for 1/nuclear norm minimization
نویسندگان
چکیده
Yurii Nesterov and Arkadi Nemirovski Acta Numerica / Volume 22 / May 2013, pp 509 575 DOI: 10.1017/S096249291300007X, Published online: 02 April 2013 Link to this article: http://journals.cambridge.org/abstract_S096249291300007X How to cite this article: Yurii Nesterov and Arkadi Nemirovski (2013). On firstorder algorithms for l 1/nuclear norm minimization. Acta Numerica, 22, pp 509575 doi:10.1017/S096249291300007X Request Permissions : Click here
منابع مشابه
Some first order algorithms for `1/nuclear norm minimization
In the last decade, the problems related to l1/nuclear norm minimization attract a lot of attention in Signal Processing, Machine Learning and Optimization communities. In this paper, devoted to `1/nuclear norm minimization as “optimization beasts,” we give a detailed description of two attractive First Order optimization techniques for solving the problems of this type. The first one, aimed pr...
متن کاملScalable Algorithms for Tractable Schatten Quasi-Norm Minimization
The Schatten-p quasi-norm (0<p<1) is usually used to replace the standard nuclear norm in order to approximate the rank function more accurately. However, existing Schattenp quasi-norm minimization algorithms involve singular value decomposition (SVD) or eigenvalue decomposition (EVD) in each iteration, and thus may become very slow and impractical for large-scale problems. In this paper, we fi...
متن کاملIterative Reweighted Algorithms for Matrix Rank Minimization Iterative Reweighted Algorithms for Matrix Rank Minimization
The problem of minimizing the rank of a matrix subject to affine constraints has many applications in machine learning, and is known to be NP-hard. One of the tractable relaxations proposed for this problem is nuclear norm (or trace norm) minimization of the matrix, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Re...
متن کاملIterative reweighted algorithms for matrix rank minimization
The problem of minimizing the rank of a matrix subject to affine constraints has applications in several areas including machine learning, and is known to be NP-hard. A tractable relaxation for this problem is nuclear norm (or trace norm) minimization, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Reweighted Least...
متن کاملAn implementable proximal point algorithmic framework for nuclear norm minimization
The nuclear norm minimization problem is to find a matrix with the minimum nuclear norm subject to linear and second order cone constraints. Such a problem often arises from the convex relaxation of a rank minimization problem with noisy data, and arises in many fields of engineering and science. In this paper, we study inexact proximal point algorithms in the primal, dual and primal-dual forms...
متن کامل